The Marginal Operators for Games on Convex geometries
نویسندگان
چکیده
In this work we study situations in which communication among the players is not complete and it is represented by a family of subsets of the set of players. Although several models of partial cooperation have been proposed, we shall follow a model derived from the work of Faigle and Kern. We define the games on convex geometries and introduce marginal worth vectors and quasi-supermodular games. Furthermore, we analyze some properties of the marginal operators on the space of games on convex geometries.
منابع مشابه
Marginal operators for games on convex geometries
We introduce marginal worth vectors and quasi-supermodular games on convex geometries. Furthermore, we study some properties of the minimal marginal operator and the maximal marginal operator on the space of the games on convex geometries. 1991 Mathematics Subject Classi...cation: 90D12
متن کاملWeighted composition operators between growth spaces on circular and strictly convex domain
Let $Omega_X$ be a bounded, circular and strictly convex domain of a Banach space $X$ and $mathcal{H}(Omega_X)$ denote the space of all holomorphic functions defined on $Omega_X$. The growth space $mathcal{A}^omega(Omega_X)$ is the space of all $finmathcal{H}(Omega_X)$ for which $$|f(x)|leqslant C omega(r_{Omega_X}(x)),quad xin Omega_X,$$ for some constant $C>0$, whenever $r_{Omega_X}$ is the M...
متن کاملCooperative games on convex geometries with a coalition structure
This paper is mainly to discuss cooperative games on convex geometries with a coalition structure, which can be seen as an extension of cooperative games with a coalition structure. For this kind of games, the cooperation among unions and within each union will be the convex sets, i.e., the feasible subsets of the coalition structure and that of each union belong to a convex geometry, respectiv...
متن کاملOn new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces
In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.
متن کاملClosure Operators and Choice Operators: a Survey (Abstract)
In this talk I will give a overview on the connections between closure operators and choice operators and on related results. An operator on a finite set S is a map defined on the set P(S) of all the subsets of S. A closure operator is an extensive, isotone and idempotent operator. A choice operator c is a contracting operator (c(A) ⊆ A, for every A ⊆ S). Choice operators and their lattices hav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IGTR
دوره 8 شماره
صفحات -
تاریخ انتشار 2006